regexp.bitState.cap (field)

19 uses

	regexp (current package)
		backtrack.go#L39: 	cap      []int
		backtrack.go#L99: 	if cap(b.cap) < ncap {
		backtrack.go#L100: 		b.cap = make([]int, ncap)
		backtrack.go#L102: 		b.cap = b.cap[:ncap]
		backtrack.go#L104: 	for i := range b.cap {
		backtrack.go#L105: 		b.cap[i] = -1
		backtrack.go#L247: 				b.cap[inst.Arg] = pos
		backtrack.go#L250: 				if inst.Arg < uint32(len(b.cap)) {
		backtrack.go#L252: 					b.push(re, pc, b.cap[inst.Arg], true) // come back when we're done.
		backtrack.go#L253: 					b.cap[inst.Arg] = pos
		backtrack.go#L274: 			if len(b.cap) == 0 {
		backtrack.go#L281: 			if len(b.cap) > 1 {
		backtrack.go#L282: 				b.cap[1] = pos
		backtrack.go#L285: 				copy(b.matchcap, b.cap)
		backtrack.go#L323: 		if len(b.cap) > 0 {
		backtrack.go#L324: 			b.cap[0] = pos
		backtrack.go#L350: 			if len(b.cap) > 0 {
		backtrack.go#L351: 				b.cap[0] = pos